Universal Logical Gates on Topologically Encoded Qubits via Constant-Depth Unitary Circuits
نویسندگان
چکیده
منابع مشابه
Universal gates for non-unitary quantum circuit
Quantum circuit is generalized to include non-unitary gates which are operated by quantum measurement. A 1-qubit non-unitary gate, together with the controlled-NOT gate and the 1-qubit unitary gate, is shown to constitute a universal set of gates for the non-unitary quantum circuit that reduces the number of the overhead of qubits required to ensure fault tolerance. A reversing measurement sche...
متن کاملOn the computational power of constant-depth quantum circuits with gates for addition
We investigate a class QNC(ADD) that is QNC with gates for addition of two binary numbers, where QNC is a class consisting of quantum operations computed by constant-depth quantum circuits. We show that QNC(ADD) = QAC(PAR) = QAC(MUL), where QAC(PAR) and QAC(MUL) are QAC with gates for parity and multiplication respectively, and where QAC is QNC with Toffoli gates of arbitrary fan-in. In the cla...
متن کاملLogical Gates via Gliders Collisions
An elementary cellular automaton with memory is a chain of finite state machines (cells) updating their state simultaneously and by the same rule. Each cell updates its current state depending on current states of its immediate neighbours and a certain number of its own past states. Some cellstate transition rules support gliders, compact patterns of non-quiescent states translating along the c...
متن کاملProtocol for Universal Gates in Optimally Biased Superconducting Qubits
0031-9007= We present a new experimental protocol for performing universal gates in a register of superconducting qubits coupled by fixed on-chip linear reactances. The qubits have fixed, detuned Larmor frequencies and can remain, during the entire gate operation, biased at their optimal working point where decoherence due to fluctuations in control parameters is suppressed to first order. Two-...
متن کاملComputing Majority by Constant Depth Majority Circuits with Low Fan-in Gates
We study the following computational problem: for which values of k, the majority of n bits MAJn can be computed with a depth two formula whose each gate computes a majority function of at most k bits? The corresponding computational model is denoted by MAJk ◦MAJk. We observe that the minimum value of k for which there exists a MAJk ◦MAJk circuit that has high correlation with the majority of n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2020
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.125.050502